Technical Note—A Generalized Bounding Method for Multifacility Location Models
نویسندگان
چکیده
منابع مشابه
Duality Results for Extended Multifacility Location Problems
Duality statements are presented for multifacility location problems as suggested by Drezner (1991), where for each given point the sum of weighted distances to all facilities plus set-up costs is determined and the maximal value of these sums is to be minimized. We develop corresponding dual problems for the cases with and without set-up costs and present associated optimality conditions. In t...
متن کاملHard cases of the multifacility location problem
Let μ be a rational-valued metric on a finite set T . We consider (a version of) the multifacility location problem: given a finite set V ⊇ T and a function c : V2 ) → Z+, attach each element x ∈ V − T to an element γ(x) ∈ T minimizing ∑(c(xy)μ(γ(x)γ(y)) : xy ∈ V2 ) ), letting γ(t) := t for each t ∈ T . Large classes of metrics μ have been known for which the problem is solvable in polynomial t...
متن کاملA Multifacility Location Problem on Median Spaces
This paper is concerned with the problem of locating II new facilities in the median space when there are k facilities already located. The objective is to minimize the weighted sum of distances. Necessary and sufficient conditions are established. Based on these results a polynomial algorithm is presented. The algorithm requires the solution of a sequence of minimum-cut problems. The complexit...
متن کاملParallel algorithms for continuous multifacility competitive location problems
We consider a continuous location problem in which a firm wants to set up two or more new facilities in a competitive environment. Both the locations and the qualities of the new facilities are to be found so as to maximize the profit obtained by the firm. This hard-to-solve global optimization problem has been addressed in [38] using several heuristic approaches. Through a comprehensive comput...
متن کاملAn Efficient Algorithm for Capacitated Multifacility Location Problems
In this paper, a squared-Euclidean distance multifacility location problem with inseparable demands under balanced transportation constraints is analyzed. Using calculus to project the problem onto the space of allocation variables, the problem becomes minimizing concave quadratic integer programming problem. The algorithm based on extreme point ranking method combining with logical techniques ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1989
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.37.4.653